Evolutionary $n$ -Level Hypergraph Partitioning With Adaptive Coarsening
نویسندگان
چکیده
منابع مشابه
Evolutionary n-level Hypergraph Partitioning with Adaptive Coarsening
Hypergraph partitioning is an NP-hard problem that occurs in many computer science applications where it is necessary to reduce large problems into a number of smaller, computationally tractable sub-problems, with the consequent desire that these should be as independent as possible to reduce the inevitable side-effects of not taking a global approach. Current techniques use a multilevel approa...
متن کاملn-Level Hypergraph Partitioning
We develop a multilevel algorithm for hypergraph partitioning that contracts the vertices one at a time and thus allows very high quality. This includes a rating function that avoids nonuniform vertex weights, an efficient “semi-dynamic” hypergraph data structure, a very fast coarsening algorithm, and two new local search algorithms. One is a k-way hypergraph adaptation of Fiduccia-Mattheyses l...
متن کاملAggregative Coarsening for Multilevel Hypergraph Partitioning
Algorithms for many hypergraph problems, including partitioning, utilize multilevel frameworks to achieve a good trade-off between the performance and the quality of results. In this paper we introduce two novel aggregative coarsening schemes and incorporate them within state-of-the-art hypergraph partitioner Zoltan. Our coarsening schemes are inspired by the algebraic multigrid and stable matc...
متن کاملRelaxation-Based Coarsening for Multilevel Hypergraph Partitioning
Multilevel partitioning methods that are inspired by principles of multiscaling are the most powerful practical hypergraph partitioning solvers. Hypergraph partitioning has many applications in disciplines ranging from scientific computing to data science. In this paper we introduce the concept of algebraic distance on hypergraphs and demonstrate its use as an algorithmic component in the coars...
متن کاملEvolutionary Hypergraph Partitioning
The hypergraph partitioning problem has many applications like processor load balance or VLSI design. For most applications solution quality is crucial. Since the problem is NP-hard, heuristics and meta heuristics are used in practice to solve the problem. In this thesis we combine the commonly used multilevel heuristic with an evolutionary algorithm. Experimental results show that our new algo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Evolutionary Computation
سال: 2019
ISSN: 1089-778X,1089-778X,1941-0026
DOI: 10.1109/tevc.2019.2896951